Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
541	Welcome Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We are delighted to announce the IPEC 2010 winners of the Excellent Student Paper Awards. The meeting was expertly organized in Chennai Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:22:16 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Complexity classes Tree decomposition Dominating set International Colloquium on Automata Languages and Programming Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
542	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics
543	CCCG 2009, Vancouver, BC, August 17–19, 2009 How to make a picturesque maze Yoshio Okamoto∗† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:33:29 Mazes Algorithms Spanning tree Puzzles Maze generation algorithm Maze Hamiltonian path NP-complete Maze solving algorithm Graph theory Theoretical computer science Mathematics
544	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems
545	Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:54 Network theory NP-complete problems Shortest path problem Steiner tree problem Routing algorithms Graph theory Theoretical computer science Mathematics
546	Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:08:28 Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems
547	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
548	CCCG 2010, Winnipeg MB, August 9–11, 2010 Constrained k-center and Movement to Independence Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Approximation algorithm Computational complexity theory Facility location Circle Travelling salesman problem Tower of Hanoi Theoretical computer science Geometry Mathematics
549	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximating Full Steiner Tree in a Unit Disk Graph Ahmad Biniaz∗ Anil Maheshwari∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-18 15:41:52 NP-complete problems Steiner tree problem Spanning tree Tree Graph Graph coloring Matroid theory Quasi-bipartite graph Minimum spanning tree Graph theory Theoretical computer science Mathematics
550	A Fast Algorithm for Point Labeling Problem Sasanka Roy∗ Subhasis Bhattacharjee∗ Subhas C. Nandy Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-08-05 21:28:00 NP-complete problems Combinatorial optimization 2-satisfiability Independent set Matching Automatic label placement Algorithm Dominating set Partial cube Theoretical computer science Mathematics Graph theory

UPDATE